Hierarchical Markov Decision Based Path Planning for Palletizing Robot
نویسندگان
چکیده
On account of the complex application environment and the large number of uncertain conditions for the palletizing robot, we do path-planning for the multiple joints robot by the algorithm based on Hierarchical Markov Decision Process. First, according to the actual working environment, we set the range of the robot’s motion and select the conventional movement combination as the basic set of the robot’s behaviors. We can get the possible reward of various situations. We divide the state space in accordance with the location information of the obstacle space into a small number of state clusters, sublevel step by step to determine the precise trajectory of palletizing robots. We simulate 3D robot motion trajectory, including barrier-free and spherical obstacle conditions. Finally, experimental verification is carried out, the algorithm has been proved to control the compatible movements of each joint effectively and keep the error within the allowed range. The experiment results meet the requirement well.
منابع مشابه
Accelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملPlanning to see: A hierarchical approach to planning visual actions on a robot using POMDPs
Flexible, general-purpose robots need to autonomously tailor their sensing and information processing to the task at hand. We pose this challenge as the task of planning under uncertainty. In our domain, the goal is to plan a sequence of visual operators to apply on regions of interest (ROIs) in images of a scene, so that a human and a robot can jointly manipulate and converse about objects on ...
متن کاملPredictive Planning for a Mobile Robot in Human Environments
Generating short and safe paths for mobile robots operating in crowded spaces is a hard task due to the high uncertainty of each person’s future behaviour. Classical path planning approaches often result in an over-constrained or overly cautious robot that fails to produce a feasible, safe path in the crowd, or plans a large, sub-optimal detour to avoid people in the scene. This work addresses ...
متن کاملHumanoid robot path planning with fuzzy Markov decision processes
In contrast to the case of known environments, path planning in unknown environments, mostly for humanoid robots, is yet to be opened or further development. This is mainly attributed to the fact that obtaining thorough sensory information about an unknown environment is not unctionally or economically applicable. This study alleviates the latter problem by resorting to a novel approach through...
متن کاملRobust Path Planning in GPS-Denied Environments Using the Gaussian Augmented Markov Decision Process
As the field of autonomous robotics continues to mature, the ability for robots to operate reliably in the presence of noise and incomplete information is becoming increasingly critical. State estimation techniques such as the Kalman filter explicitly model sensor noise and incomplete information by computing a probability distribution over the possible states. The uncertainty of the posterior ...
متن کامل